Strategies for Mechanizing Structural Induction
نویسنده
چکیده
A t heo rem p r o v i n g sys tem has been programmed f o r a u t o m a t i n g m i l d l y complex p r o o f s b y s t r u c t u r a l i n d u c t i o n . One pu rpose was t o p r o v e p r o p e r t i e s o f s i m p l e f u n c t i o n a l p rograms w i t h o u t l o o p s o r a s s i g n m e n t s . One can see t h e f o r m a l sys tem as a g e n e r a l i z a t i o n o f number t h e o r y : t h e f o r m a l l anguage i s t y p e d and t h e i n d u c t i o n r u l e i s v a l i d f o r a l l t y p e s . P r o o f s a r e g e n e r a t e d b y w o r k i n g backward f r o m t h e g o a l . The i n d u c t i o n s t r a t e g y s p l i t s i n t o two p a r t s : (1) t h e s e l e c t i o n o f i n d u c t i o n v a r i a b l e s , w h i c h i s c l a i m e d t o b e l i n k e d t o t h e u s e f u l g e n e r a l i z a t i o n o f t e r m s t o v a r i a b l e s , and (2) t h e g e n e r a t i o n o f i n d u c t i o n s u b g o a l s , i n p a r t i c u l a r , t h e s e l e c t i o n and s p e c i a l i z a t i o n o f h y p o t h e s e s . O the r s t r a t e g i e s i n c l u d e a f a s t s i m p l i f i c a t i o n a l g o r i t h m . The p r o v e r can cope w i t h s i t u a t i o n s a s complex a s t h e d e f i n i t i o n and c o r r e c t n e s s p r o o f o f a s i m p l e c o m p i l i n g a l g o r i t h m f o r e x p r e s s i o n s . A f t e r a n o v e r v i e w o f t h e f o r m a l sys tem and t h e sea rch s t r a t e g y , t h e paper e x p l a i n s how i n d u c t i o n v a r i a b l e s a r e s e l e c t e d , w h i c h i n c l u d e s g e n e r a l i z a t i o n , and how i n d u c t i o n subgoa l s a r e g e n e r a t e d . F i n a l l y , o t h e r s t r a t e g i e s a r e p r e s e n t e d , i n c l u d i n g s i m p l i f i c a t i o n . A d e t a i l e d example and t e c h n i c a l remarks c o n s t i t u t e t h e a p p e n d i c e s . A u b i n (1974) d e s c r i b e s t h e who le sys tem i n d e t a i l .
منابع مشابه
Applications of Unskolemization
This dissertation describes a novel method for deriving logical consequences of first-order formulas using resolution and unskolemization. A complete unskolemization algorithm is given and its properties analyzed. This method is then applied to a number of different fields, namely program verification, machine learning, and mathematical induction. The foremost problem in automating program veri...
متن کاملA. Bouhoula and F. Jacquemard Automated Induction for Complex Data Structures
In this paper, we develop a new approach for mechanizing induction on complex data structures (like sets, sorted lists, trees, powerlists. . . ). The key idea is to compute a tree grammar with constraints which describes exactly the initial model of the given specification, unlike test sets or cover sets which are approximative induction schemes when the constructors are not free. This grammar ...
متن کاملConstrained Tree Grammars to Pilot Automated Proof by Induction
In this paper, we develop a new approach for mechanizing induction on complex data structures (like bags, sorted lists, trees, powerlists. . . ) by adapting and generalizing works in tree automata with constraints. The key idea of our approach is to compute a tree grammar with constraints which describes the initial model of the given specification. This grammar is used as an induction schema f...
متن کاملMechanizing Inductive Reasoning
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We present a new method to prove (and disprove) automatically inductive properties. Given a set of axioms, a well-suited induction scheme is constructed automatically. We call such a scheme a test-set. Then, for proving a...
متن کاملAncestral Logic: A Proof Theoretical Study
Many efforts have been made in recent years to construct formal systems for mechanizing mathematical reasoning. A framework which seems particularly suitable for this task is ancestral logic – the logic obtained by augmenting first-order logic with a transitive closure operator. While the study of this logic has so far been mostly modeltheoretical, this work is devoted to its proof theory (whic...
متن کاملThe Use of Planning Critics in Mechanizing Inductive Proofs
Proof plans provide a technique for guiding the search for a proof in the context of tactical style reasoning. We propose an extension to this technique in which failure may be exploited in the search for a proof. This extension is based upon the concept of planning critics. In particular we illustrate how proof critics may be used to patch proof plans in the domain of inductive proofs.
متن کامل